package gold.digger;

import gold.utils.InputUtil;

import java.util.Arrays;

/**
 * Created by fanzhenyu02 on 2021/12/10.
 * common problem solver template.
 */
public class LC1672 {
    public long startExecuteTime = System.currentTimeMillis();


    class Solution {
        public int maximumWealth(int[][] accounts) {
            int maxWealth = Integer.MIN_VALUE;
            for (int[] account : accounts) {
                maxWealth = Math.max(maxWealth, Arrays.stream(account).sum());
            }
            return maxWealth;
        }
    }


    public void run() {
        int[] arr = InputUtil.toIntegerArray("[1,2,3]");
        System.out.println(new Solution().toString());
    }

    public static void main(String[] args) throws Exception {
        LC1672 an = new LC1672();
        an.run();

        System.out.println("\ncurrent solution total execute time: " + (System.currentTimeMillis() - an.startExecuteTime) + " ms.");
    }
}
